Uniform approximation of metrics by graphs
نویسندگان
چکیده
منابع مشابه
Uniform Approximation by Elementary Operators
On a separable C-algebra A every (completely) bounded map which preserves closed two sided ideals can be approximated uniformly by elementary operators if and only if A is a finite direct sum of C-algebras of continuous sections vanishing at ∞ of locally trivial C-bundles of finite type.
متن کاملOn uniform approximation by splines
for 0 ≤ r ≤ k − 1. In particular, dist (f, S π) = O(|π| ) for f ∈ C(I), or, more generally, for f ∈ C(I), such, that f (k−1) satisfies a Lipschitz condition, a result proved earlier by different means [2]. These results are shown to be true even if I is permitted to become infinite and some of the knots are permitted to coalesce. The argument is based on a “local” interpolation scheme Pπ by spl...
متن کاملUniform approximation by (quantum) polynomials
We show that quantum algorithms can be used to re-prove a classical theorem in approximation theory, Jackson’s Theorem, which gives a nearly-optimal quantitative version of Weierstrass’s Theorem on uniform approximation of continuous functions by polynomials. We provide two proofs, based respectively on quantum counting and on quantum phase estimation.
متن کاملUNIFORM APPROXIMATION BY b – HARMONIC FUNCTIONS
The Mergelyan and Ahlfors-Beurling estimates for the Cauchy transform give quantitative information on uniform approximation by rational functions with poles off K. We will present an analogous result for an integral transform on the unit sphere in C2 introduced by Henkin, and show how it can be used to study approximation by functions that are locally harmonic with respect to the Kohn Laplacia...
متن کاملUniform approximation by discrete least squares polynomials
We study uniform approximation of differentiable or analytic functions of one or several variables on a compact set K by a sequence of discrete least squares polynomials. In particular, if K satisfies a Markov inequality and we use point evaluations on standard discretization grids with the number of points growing polynomially in the degree, these polynomials provide nearly optimal approximant...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the American Mathematical Society
سال: 2014
ISSN: 0002-9939,1088-6826
DOI: 10.1090/s0002-9939-2014-12299-4